Exploiting Plaintiffs through Settlement: Divide and Conquer

A Divide and Conquer Algorithm for Exploiting Policy Function Monotonicity

A divide-and-conquer algorithm for exploiting policy function monotonicity is proposed and analyzed. To compute a discrete problem with n states and n choices, the algorithm requires at most 5n+ log2(n)n function evaluations and so is O(n log2 n). In contrast, existing methods for non-concave problems require n evaluations in the worstcase and so are O(n). The algorithm holds great promise for ...

Divide and Conquer

An instance of the given problem is divided into easier instances of the same problem, which are solved recursively and then combined to create a solution to the original instance. Of course, divide and conquer is not suitable for every problem. A divide and conquer approach will only work if the problem is easily divided into a small number of easier sub-problems, and the solution to the entir...

Divide and (Iteratively) Conquer!

The Iterative Multi-Agent (IMA) Method works by breaking down a search problem into many sub-problems, each to be solved separately. Independent problem solving agents work on the sub-problems and use iteration to handle any interaction between the sub-problems. Each agent knows about a subset of the whole problem and cannot solve it all by itself. The agents, working in parallel, can use any m...

Cheaters divide and conquer

Three 'killer genes' in one species of fission yeast act selfishly and keep it reproductively isolated from a closely related species.

Divide-And-Conquer Sorting